H-supermagic labelings of graphs

A simple graph G admits an H-covering if every edge in E(G) belongs to a subgraph of G isomorphic to H. The graph G is H−magic if there exists a bijection f : V (G) [ E(G) ! {1, 2, 3, · · · , |V (G) [ E(G)|} such that for every subgraph H0 P of G isomorphic to H. G is said to be H − supermagic if f(V (G)) = {1, 2, 3, · · · , |V (G)|}. In this paper, we study cycle-(super)magic labelings of chain graphs, fans, triangle laders, graphs obtained by joint of a star K1,n with one isolated vertex, laders, and books and P3-(super)magic labelings of cycles. Additionally, we study the dual labeling and present some lower and upper bounds of the magic constant of an H-supermagic labeling.